Fundamental Analysis towards Partial Data Aggregation in Wireless Sensor Networks

ABSTRACT Recently, for energy saving in wireless sensor networks, the data aggregation technique has been proposed. In this paper, we discuss the trade off between communication delay and energy consumption of the technique. At first, we analyze the full aggregation compared with nonaggregation with Markovian chain and simulation. The result shows that non-aggregation method suffers large energy consumption while full aggregation suffers large transmitting delay. Then, a partial aggregation method called WRP (Waterfalls Random partial aggregation) is proposed. In WRP, each node has an independent random pushing rate. The nearer node to the sink has smaller rate, which tends to full aggregation. The effect of WRP is discussed via simulation results.